#include <iostream>
#include <queue>
#include <map>
#include <unordered_map>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <cstring>
#include <set>
#include <unordered_set>
using namespace std;
typedef long long ll;
typedef unsigned long long Ull;
typedef pair<int,int> PII;
const int INF=0x3f3f3f3f;
const int N=1e6+10;
int row[N];
int col[N];
int up[2*N];
int down[2*N];
int main()
{
	int n=0;
	int t=0;
	cin>>n>>t;
	int x,y;
	while(t--)
	{
		scanf("%d %d",&x,&y);
		x++;
		y++;
		if(row[x]==0 && col[y]==0 && down[x-y+n]==0 && up[2*n+1-x-y]==0)
		{
			printf("Yes\n");
			row[x]=1 ;col[y]=1 ; down[x-y+n]=1 ;up[2*n+1-x-y]=1;
		}
		else
		{
			printf("No\n");
		}
	}
	

	return 0;
}

